Transmission method for transmitting data symbols to or from users of an ultra bandwidth telecommunication system

ABSTRACT

The invention relates to a transmission method for transmitting data symbols to or from users of an ultra bandwidth telecommunication system, each user (u) of said system being associated with a specific time hopping pattern consisting of a plurality (N s , N b ) of integers (c j   u ), the signal transmitted to or from a user consisting of sequences of the same plurality of frames, each integer of said pattern being associated with a corresponding frame and each frame containing a pulse time-shifted from the beginning thereof by an amount (c j   u T c ) determined by said associated integer, the pulses of one sequence being further position modulated by one or a plurality (n b ) of data symbols to be transmitted to or from said user. According to the transmission method of the invention, the time at which a sequence of a user is transmitted is obtained from a pseudo-random sequence specific to said user. The invention equally relates to the corresponding transmitter.

CROSS REFERENCE TO RELATED APPLICATIONS

[0001] The present application relates to EPC patent application 02292519.2, filed on Oct. 11, 2002, the entire contents of which are incorporated by reference.

BACKGROUND OF INVENTION

[0002] 1. Field of the Invention

[0003] The present invention relates to a transmission method and a transmitter for use in an ultra wide bandwidth (UWB) telecommunication system, including in an impulse radio system.

[0004] 2. Description of the Related Art

[0005] UWB is a known spread spectrum technique which originates from the radar field and has recently gained considerable interest for use in short-range wireless communication, especially for indoor applications. One of the most promising UWB schemes, proposed by R. A. Scholtz in 1993 and also called Impulse Radio (IR), is based on the transmission of sequences of very short pulses. More specifically, as described in detail further below, Impulse Radio relies upon pulse modulation for modulating the data to be transmitted and ensures multiple access by providing different time-hopping sequences to different users. A comprehensive review of the UWB communication techniques, including impulse radio, can be found in the PhD thesis of T. Erseghe available on the website www.dei.unipd.it/˜erseghe/.

[0006] Let us consider an impulse radio system in which data symbols are transmitted to or from different users u, u=1, . . . , N_(u). Each user u is allocated a time-hopping pattern defined by a plurality N_(s) of integers c_(j) ^(u), j=0, . . . , N_(s)−1 where N_(s) is the number of transmission time intervals (hereinafter referred to as frames) used for transmitting a symbol and the integers c_(j) ^(u) belong to , [0, N_(c)−1], each frame being constituted of N_(c) chips. The UWB signal transmitted to or from a given user u is obtained by modulating a basic sequence specific thereto and that can be expressed as:

S ^(u)(t)=δ^(u)(t){circle over (×)}p(t)   (1)

[0007] where p(t) is a function giving the waveform of a single pulse, {circle over (×)} denotes the convolution operation and δ^(u)(t) is defined as: $\begin{matrix} {{\delta^{u}(t)} = {\sum\limits_{j = 0}^{N_{s} - 1}{\delta \left( {t - {j\quad T_{f}} - {c_{j}^{u}T_{c}}} \right)}}} & (2) \end{matrix}$

[0008] in which δ(t) denotes the Dirac function, T_(ƒ)and T_(c) are respectively the duration of a frame and of a chip. δ^(u)(t) represents therefore a series of Dirac peaks, each peak being located in a frame (j) and being time shifted by an amount (c_(j) ^(u)T_(c)) from the beginning thereof.

[0009] The basic sequence of user u is modulated according to a pulse position modulation (PPM) with a data symbol to be transmitted to or from user u. More specifically, to each possible symbol b is assigned a binary encoded sequence b_(j), j=0, . . . , N_(s)−1 and the transmitted UWB signal relative to symbol b and user u can be formulated as: $\begin{matrix} {{s^{u}(t)} = {\sum\limits_{j = 0}^{N_{s} - 1}{p\left( {t - {j\quad T_{f}} - {c_{f}^{u}T_{c}} - {b_{j}\delta}} \right)}}} & (3) \end{matrix}$

[0010] where δ is a time shift which is chosen much smaller than T_(c).

[0011] Without loss of generality, it may be assumed that the symbols b to be transmitted are simple bits and that the binary sequences assigned to b=0 and b=1 are respectively given by:

b_(j)=0,∀j if b=0

b_(j)=1,∀j if b=1

[0012] In such instance, the transmitted UWB signal corresponding to a bit b can simply be reformulated as: $\begin{matrix} {{s^{u}(t)} = {{S^{u}\left( {t - {b\quad \delta}} \right)} = {\sum\limits_{j = 0}^{N_{s} - 1}{p\left( {t - {j\quad T_{f}} - {c_{j}^{u}T_{c}} - {b\quad \delta}} \right)}}}} & (4) \end{matrix}$

[0013] More generally, if a sequence of bits b_(m) is transmitted to or from a user u, the corresponding transmitted UWB signal can be expressed as: $\begin{matrix} {{s_{tr}^{u}(t)} = {{\sum\limits_{n}{S^{u}\left( {t - {n\quad T_{s}} - {b_{n}\delta}} \right)}} = {\sum\limits_{n}{\sum\limits_{j = 0}^{N_{s} - 1}{p\left( {t - {n\quad T_{s}} - {j\quad T_{f}} - {c_{j}^{u}T_{c}} - {b_{n}\delta}} \right)}}}}} & (5) \end{matrix}$

[0014]FIG. 1 shows an example of a basic sequence S^(u)(t) relative to a user u where the pulse waveform p(t) has been zoomed in at the bottom part thereof. In the present example, the basic sequence is constituted of N_(s)=6 frames, each frame being in turn sub-divided into N_(c)=16 chips. The beginning of a frame is represented by a longer vertical stroke than the one indicating the beginning of a chip and the arrows referenced 100 to 105 represent the Dirac peaks of the above defined function δ^(u)(t), each peak being shifted by an amount given by the corresponding values c_(j) ^(u) of the time hopping pattern of user u. The basic sequence S^(u)(t) carries a pulse of waveform p(t) at the respective locations of the Dirac peaks. For example, the pulse may be a so-called Rayleigh monopulse the waveform of which is given by: $\begin{matrix} {{p(t)} = {\frac{t}{\sigma^{2}} \cdot {\exp \left( \frac{- t^{2}}{2\sigma^{2}} \right)}}} & (6) \end{matrix}$

[0015] where σ is a value representative of the pulse width. The shape of the waveform has been schematically represented at the bottom of the FIG. 1.

[0016] Typically, the pulse width is about 0.5 ns, the frame duration T_(ƒ) is a time of the order of 100 ns and T_(s) is a time of the order of 1 μs.

[0017] When a bit to be sent has a first value, e.g. “0”, the sequence of the user is transmitted as such. Conversely, when said bit to be sent takes the opposite value, e.g. “1”, the positions of the pulses are shifted by a very small amount δ, typically in the order of 50 ps, relatively to the time origin of the basic sequence.

[0018] Let us first consider a transmitter sending an UWB signal over a transmission channel to a receiver (where the transmitter can be located either at a base station or at a user terminal). We assume first that a single user is active (either by transmitting or receiving). The received UWB signal can be expressed as: $\begin{matrix} {{s_{rec}(t)} = {{\sum\limits_{k}{{a_{k}(t)}{s_{tr}^{u}\left( {t - \theta^{u} - {\tau_{k}(t)}} \right)}}} + {w(t)}}} & (7) \end{matrix}$

[0019] where k indexes the different propagation paths of the transmission channel, α_(k)(t) and τ_(k)(t) are respectively the attenuation coefficients and propagation delays relative to the different propagation paths, θ^(u)ε[0,T_(s)[ denotes a time shift between the beginning of the transmission of the UWB signal of user u and a synchronisation time origin, w(t) is the thermal noise of the receiver, assumed to be additive white gaussian (AWGN) with a bilateral spectral power density N₀/2.

[0020] In practice, for typical indoor applications and slow moving users (that is for moving speeds lower than 10 ms⁻¹), the functions α_(k)(t) and τ_(k)(t) can be regarded as constant over a time range of the order of 100 μs (corresponding to the transmission time of about 100 symbols) and therefore the expression of received signal can be simplified as: $\begin{matrix} {{s_{rec}(t)} = {{\sum\limits_{k}{a_{k}{s_{tr}^{u}\left( {t - \theta^{u} - \tau_{k}} \right)}}} + {w(t)}}} & (8) \end{matrix}$

[0021] where α_(k) and τ_(k) are constant values.

[0022] Considering now the case of a multi-user system comprising a plurality N_(u) of transmitters, the received signal can be expressed as: $\begin{matrix} {{s_{rec}(t)} = {{\sum\limits_{q = 1}^{N_{u}}{\sum\limits_{k_{q}}{a_{k_{q}}^{q}{s_{tr}^{q}\left( {t - \theta^{q} - \tau_{k_{q}}^{q}} \right)}}}} + {w(t)}}} & (9) \end{matrix}$

[0023] where k_(q) now indexes the propagation paths of the transmission channels between the different transmitters and the receiver in question and α_(k) _(q) ^(q), τ_(k) _(q) ^(q) are the respectively the attenuation coefficient and the propagation delay relative to the k^(th) propagation path of the q^(th) transmission channel. This expression reflects the typical situation where a plurality of users transmit data symbols over their respective uplink transmission channels to a base station.

[0024] Similarly, for a downlink transmission in a multi-user system, since a single transmission channel has to be considered per user, the signal received by user u can be expressed as: $\begin{matrix} {{s_{rec}(t)} = {{\sum\limits_{q = 1}^{N_{u}}{\sum\limits_{k}{a_{k}^{u}{s_{tr}^{q}\left( {t - \theta^{q} - \tau_{k}^{u}} \right)}}}} + {w(t)}}} & (10) \end{matrix}$

[0025] where α_(k) ^(u) and τ_(k) ^(u) are respectively the attenuation coefficient and the propagation delay of the k^(th) propagation path of the downlink transmission channel relative to user u.

[0026] Let us consider the n^(th) bit transmitted to or from user u and denote: $\begin{matrix} {{s_{0}^{u}(t)} = {{\sum\limits_{k}{a_{k}^{u}{s_{tr}^{u}\left( {t - \theta^{u} - \tau_{k}^{u}} \right)}\quad \text{when}\quad b_{n}}} = {0\quad {in}\quad (5)}}} & (11) \end{matrix}$

[0027] and $\begin{matrix} {{s_{1}^{u}(t)} = {{\sum\limits_{k}{a_{k}^{u}{s_{tr}^{u}\left( {t - \theta^{u} - \tau_{k}^{u}} \right)}\quad \text{when}\quad b_{n}}} = {1\quad {in}\quad (5)}}} & (12) \end{matrix}$

[0028] Defining v^(u)(t)=s₁ ^(u)(t)−s₀ ^(u)(t), it can be shown that the optimal decision criterion at the receiving side is based on the decision variable: $\begin{matrix} {{\overset{\sim}{b}}_{n} = {\int_{t_{n}^{\min}}^{t_{n}^{\max}}{{s_{rec}(t)}{v^{u}(t)}{t}}}} & (13) \end{matrix}$

[0029] where $t_{n}^{\min} = {{{n\quad T_{s}} + \theta^{u} + {\min\limits_{k}{\left( \tau_{k}^{u} \right)\quad \text{and}\quad t_{n}^{\max}}}} = {{nT}_{s} + \theta^{u} + {\max\limits_{k}\left( \tau_{k}^{u} \right)} + \delta}}$

[0030] define the bounds of reception time window for the n^(th) bit of user u.

[0031] It should be noted that the decision variable {overscore (b)}_(n) can be regarded as the output of a filter matched to the impulse response of the transmission channel of user u. The bit estimate {circumflex over (b)}_(n) is obtained as follows:

{circumflex over (b)} _(n)=0 if {tilde over (b)} _(n)≦0 and {circumflex over (b)} _(n)=1 if {tilde over (b)} _(n)≧0   (14)

[0032] One of the critical issues addressed in the prior art is the choice of a set of basic sequences exhibiting good auto-correlation and cross-correlation properties. More specifically, denoting respectively $\begin{matrix} {{\pi^{u}(t)} = {{S^{u}(t)} \otimes {\sum\limits_{n}{\delta \left( {t - {nT}_{s}} \right)}}}} & (15) \end{matrix}$

[0033] the function obtained by periodically repeating the basic sequence of user u and C_(u,u′)(τ) the correlation function between π^(u)(t) and π^(u′)(t), i.e. $\begin{matrix} {{C_{u,u^{\prime}}(\tau)} = {\int_{T_{s}}{{\pi^{u}(t)}{\pi^{u^{\prime}}\left( {t + \tau} \right)}{t}}}} & (16) \end{matrix}$

[0034] the choice of a set a of sequences is based on the quality criteria: $\begin{matrix} {S_{\max} = {{\max\limits_{{u \in \sigma},{\tau \neq 0}}{\left( {C_{u,u}(\tau)} \right)\quad \text{and}\quad C_{\max}}} = {\max\limits_{u,{u^{\prime} \in \sigma},{\tau \in {\lbrack{O,T_{s}}\rbrack}}}\left( {C_{u,u^{\prime}}(t)} \right)}}} & (17) \end{matrix}$

[0035] The first quality criterion is a low value of S_(max), which means that the respective auto-correlation functions of the basic sequences of the different users exhibit low level side-lobes, improving thereby synchronisation at the receiving side. The second quality criterion is a low value of C_(max), which favours the reduction of multi-access interference. It will be appreciated that C_(u,u′)(τ) is representative of the overlap between the two delayed basic sequences and essentially depends upon the number of coincidences (or hits) between delayed versions of the hopping patterns of users u and u′.

[0036]FIGS. 2A and 2B illustrate the situation where a basic sequence of a given user u interferes with a basic sequence of another user u′ at the receiving side. This could be the case if, for example, the two sequences have travelled along different propagation paths, although their respective transmitters are synchronised. This could also be the case, if these sequences have travelled along the same propagation path but their respective transmitters are not synchronised (or, alternatively, neither their propagation paths are the same nor their respective transmitters are synchronised).

[0037] As a matter of example, while FIG. 2A shows a case where the collision can be resolved by the receiver, FIG. 2B shows a severe collision of sequences with a large score of hits leading to a high probability of false detection. Such type of collision will be hereinafter referred to as catastrophic.

[0038] In practice, the risk of collision between received sequences is not negligible and can dramatically increase the bit error rate of the communication affected by the collision. This is all the more significant since the characteristics of the transmission channels are likely to be constant in an indoor environment (e.g. the transmitter(s) and receiver(s) are fixed) and therefore a catastrophic collision may repeat at quite a high rate.

SUMMARY OF INVENTION

[0039] A first object of the invention is therefore to propose a transmission method (and corresponding transmitter) for reducing the bit error rate in an UWB telecommunication system.

[0040] The above mentioned object is attained by the transmission method of the invention as defined in appended claim 1 and the associated transmitter defined in appended claim 10.

[0041] A subsidiary object of the invention is to provide a set of sequences satisfying a quality criterion ensuring a low bit error rate. This object is attained by the transmission method of the invention as defined in dependent claim 7.

[0042] Advantageous embodiments of the invention are defined in the further dependent claims.

DESCRIPTION OF THE DRAWINGS

[0043] The advantages and characteristics of the invention will emerge from a reading of the following description given in relation to the accompanying figures, amongst which:

[0044]FIG. 1 depicts schematically an example of basic sequence of a user of a conventional UWB telecommunication system;

[0045]FIGS. 2A and 2B depict schematically two examples of collision between basic sequences of two different users of a conventional UWB telecommunication system;

[0046]FIG. 3 depicts schematically an embodiment of a transmitter according to the invention.

DETAILED DESCRIPTION

[0047] We refer back again to the context of an UWB telecommunication system in which multi-access is provided by different time hopping patterns δ^(u) (and, hence, different basic sequences S^(u)).

[0048] In the present invention the time shifts θ^(u) of the different users are randomized so as to avoid recurrent catastrophic collision schemes. More specifically, the present invention generates time shifts θ^(u) from a pseudo-random sequence specific to user u, a new time shift being typically generated at a multiple of the symbol period T_(s). At the receiving side, the knowledge of the pseudo-random sequence allows to compensate for the time shifts θ^(u) and therefore to synchronise with the basic sequences of user u while the basic sequences of any other user will appear to start at random time positions relatively thereto.

[0049] First, the concept of basic sequence set out above will be extended. The basic sequence of a user u will be assumed to adopt the more general form: $\begin{matrix} {{S^{u}(t)} = {{\sum\limits_{j = 0}^{N_{b} - 1}{{p\left( {t - {j\quad T_{f}} - {c_{j}^{u}T_{c}}} \right)}\quad \text{where}\quad N_{b}}} = {n_{b} \cdot N_{s}}}} & (18) \end{matrix}$

[0050] where the integers c_(j) ^(u), j=0, . . . , N_(b)−1 define the time hopping pattern relative to the user u, i.e. ${\delta^{u}(t)} = {\sum\limits_{j = 0}^{N_{b} - 1}{{p\left( {t - {j\quad T_{f}} - {c_{j}^{u}T_{c}}} \right)}.}}$

[0051] The basic sequence defined in (18) can be pulse position modulated (PPM) by a block B of n_(b) consecutive data symbols: b₀, b₁, . . . , b_(n) _(b) ⁻¹, e.g. bits to produce an UWB signal: $\begin{matrix} {{s_{B}^{u}(t)} = {\sum\limits_{n = 0}^{n_{b} - 1}{\sum\limits_{j = 0}^{N_{s} - 1}{{p\left( {t - {n\quad T_{s}} - {j\quad T_{f}} - {c_{{n\quad N_{s}} + j}^{u}T_{c}} - {b_{n}\delta}} \right)}.}}}} & (19) \end{matrix}$

[0052] that is, for a series of concatenated blocks B_(m): $\begin{matrix} {{s_{tr}^{u}(t)} = {\sum\limits_{m}{s_{B_{m}}^{u}\left( {t - {m\quad T_{b}}} \right)}}} & (20) \end{matrix}$

[0053] where T_(b)=n_(b)T_(s) is the block time length and the block B_(m) is constituted of symbols b_(m,0),b_(m,1), . . . , b_(m,n) _(b) ⁻¹.

[0054] In contrast to expression (5), the time hopping pattern c_(j) ^(u),j=0, . . . , N_(b)−1 appearing in the more general expression (19) encodes one or a plurality (n_(b)) of data symbols.

[0055] According to the invention, a pseudo-random time shift (or delay) θ_(m) ^(u) is introduced prior to the transmission of each block B_(m), so that the UWB signal transmitted to or from user u can finally be written: $\begin{matrix} {{s_{tr}^{u}(t)} = {\sum\limits_{m}{s_{B_{m}}^{u}\left( {t - \theta_{m}^{u} - {m\quad T_{b}}} \right)}}} & (21) \end{matrix}$

[0056] The provision of a pseudo-random delay θ_(m) ^(u) for each user u considerably reduces the risk of recurring catastrophic collisions between received sequences and therefore improves the bit error rate.

[0057] Furthermore, the pseudo-random sequence giving the delays θ_(m) ^(u) being known from the receiver, these delays can be compensated for in the expressions s₀ ^(u)(t) and s₀ ^(u)(t), that is for a given symbol b_(m,n) of block B_(m): $\begin{matrix} {{s_{0}^{u}(t)} = {{\sum\limits_{k}{a_{k}^{u}{s_{B_{m}}^{u}\left( {t - \theta_{m}^{u} - \tau_{k}^{u}} \right)}\quad \text{when}\quad b_{m,n}}} = {0\quad {in}\quad (20)}}} & (22) \end{matrix}$

[0058] and $\begin{matrix} {{s_{1}^{u}(t)} = {{\sum\limits_{k}{a_{k}^{u}{s_{B_{m}}^{u}\left( {t - \theta_{m}^{u} - \tau_{k}^{u}} \right)}\quad \text{when}\quad b_{m,n}}} = {1\quad {in}\quad (20)}}} & (23) \end{matrix}$

[0059] As stated in the background, the correlation of the received signal with the function v^(u)(t)=s₁ ^(u)(t)−s₀ ^(u)(t) gives the decision variable {tilde over (b)}_(m,n).

[0060] The structure of a transmitter according to an embodiment of the invention is schematically illustrated in FIG. 3.

[0061] The transmitter comprises first frequency dividing means (e.g. a counter) 320 inputting a clock signal at the chip frequency $f_{c} = \frac{1}{T_{c}}$

[0062] hereinafter referred to as chip frequency signal) and outputting a pulse signal at the frame frequency ${f_{f} = \frac{1}{T_{f}}},$

[0063] second frequency dividing means 330 inputting said frame frequency signal and outputting a clock signal at the symbol frequency ${f_{s} = \frac{1}{T_{s}}},$

[0064] and third frequency dividing means 340 inputting said symbol frequency signal and outputting a signal at the block frequency $f_{b} = {\frac{1}{T_{b}}.}$

[0065] A pseudo-random sequence generator 311 receives said block frequency signal and transmits for each block B_(m) a pseudo-random number to a delay calculating means 310. The delay θ_(m) ^(u) thus obtained is used for initialising the first frequency dividing means 320 (e.g. for triggering the counter if a counter is used). In a variant of the invention, the delay θ_(m) ^(u) is not output at the block frequency but only at a sub-multiple frequency thereof.

[0066] The pseudo-random sequence generated by generator 311 is specific to the user u in question and could be, for example, a maximum length sequence, as known in the art. Furthermore, the variation range of the delay θ_(m) ^(u) can be chosen much narrower than the block period T_(b) itself(or much narrower than the symbol period T_(s) when n_(b)=1). By so doing, the symbol jitter is kept at low level and the useful symbol transmission rate is not reduced.

[0067] The frame frequency signal output from first dividing means 320 is modulated by time-hopping means 350 controlled by a time hopping pattern generator 351. The latter generator is initialised by the block frequency signal and clocked by the frame frequency signal. Once initialised, the generator 351 starts outputting the time hopping pattern c_(j) ^(u), j=0, . . . , N_(b)−1 at the frame frequency and, the time-hopping means 350 outputs, for each frame j, a pulse time-shifted by an amount c_(j) ^(u)·T_(c) from the beginning thereof.

[0068] The time-hopped signal generated by time-hopping means 350 is further input to the PPM modulating means 360 which delays the input signal by a time amount δ when ordered to do so by a control signal output from the delay controlling means 361.

[0069] The controlling means 361 is initialised at each symbol block B_(m) by the block frequency signal. A control signal is then generated at the symbol frequency e.g. when a data symbol b_(m,n) takes a “0” value, the time-hopped signal is not delayed by the PPM modulating means and when it takes a “1” value, the PPM modulating signal delays the time-hopped signal by a predetermined time amount δ.

[0070] The signal output from PPM modulating means 360 is constituted of very short pulses which are shaped in the pulse forming filter 370 of impulse response p(t).

[0071] It will be appreciated by one skilled in the art that the structure of the transmitter can be modified without departing from the scope of the invention. For example, the time hopped signal could be first pulse formed in 370 before being supplied to the delaying means 360. Similarly the time delay θ_(m) ^(u) could be applied at different stages of the transmitter e.g. at the input or the output of the pulse forming filter.

[0072] It should also be noted that all or parts of this transmitter can be implemented by means of a single processor either dedicated for performing all the functions depicted above or in the form of a plurality of processors either dedicated or programmed for each performing one or some of said functions.

[0073] The transmitter described above can be located either in the terminal of the user (for an uplink transmission) or in a base station (for a downlink transmission). In the latter case, the structure of the transmitter can advantageously be simplified by having first, second and third frequency dividing means in common for the different users and by time-shifting with different delays θ_(m) ^(u), the common frame, symbol and block frequency signals thus generated.

[0074] In both cases, at the receiving side, the sequences of the other users u′≠u will appear at random receiving times uniformly distributed over the interval product [0,T_(b)[×[0,T_(b)[×. . . ×[0,T_(b)[ *N_(u)−1 factors). The risk of recurring catastrophic collisions affecting the UWB transmission systems proposed in the prior art, is thereby removed.

[0075] A further advantage over the prior art is that the criterion for selecting good hopping patterns (c_(j) ^(u),j=0, . . . , N_(b)−1) with respect to multi-access interference, is significantly relaxed. It is recalled here that the quality criterion of the prior art was based on a low maximum value C_(max) of the maxima of the pattern intercorrelation functions for any pair of patterns, as defined in (17).

[0076] In contrast, when using the transmission method according to the invention, it can be shown that the bit error rate for a given user u is expressed as: $\begin{matrix} {P_{e} = {{erfc}\left\{ {\left( {1 - {\cos \quad \alpha_{\delta}}} \right) \cdot \sqrt{\frac{E^{u}}{{\sum\limits_{\underset{u^{\prime} \neq u}{u^{\prime} = 1}}^{N_{u}^{\prime}}{E^{u^{\prime}}\Gamma^{u\quad u^{\prime}}}} + {\beta_{\delta}^{2} \cdot \frac{N_{0}}{2}}}}} \right\}}} & (24) \end{matrix}$

[0077] where erfc is the tail of the gaussian function, E^(u) is the energy of the desired signal associated with user u (as obtained after path combining), E^(u′) is the energy of an interfering signal due to user u $\frac{N_{0}}{2}$

[0078] is the spectral density of the thermal noise at the receiver and: $\begin{matrix} {{\cos \quad \alpha_{\delta}} = \frac{{\langle{p\left( . \right)}}{p\left( {.{- \delta}} \right)}}{{{p\left( . \right)}}^{2}}} & (25) \end{matrix}$

$\begin{matrix} {\beta_{\delta} = \frac{{{p\left( . \right)} - {p\left( {.{- \delta}} \right)}}}{{p\left( . \right)}}} & (26) \end{matrix}$

[0079] where the notations <ƒ|g> and ∥ƒ∥ respectively stand for the scalar product of two functions ƒ, g and the norm of a function ƒ in L²(R) (i.e. ⟨fg⟩ = ∫_(−∞)^(+∞)f(t)g(t)  t);

[0080] and $\begin{matrix} {\Gamma^{{uu}^{\prime}} = {E\left( \left( \frac{\langle{{s_{tr}^{u^{\prime}}\left( {.{- \theta^{{uu}^{\prime}}}} \right)}{{{s_{B}^{u}\left( . \right)} - {s_{B}^{u}\left( . \right)}}\rangle}}}{{S}^{2}} \right)^{2} \right)}} & (27) \end{matrix}$

[0081] represents an energy coupling coefficient, E denotes the mean value taken over the possible time shifts θ^(uu′) between the users u and u′, the possible pairs of symbol blocks B and B′, B and B′ differing on one symbol only, and ∥S∥²=N_(b)∥p∥² is the energy of the transmitted signal (assumed identical for all the users).

[0082] If we assume that the delay δ is substantially smaller than the width of the pulse p(t), we can rightfully approximate s_(tr) ^(u′)(t) as the repetition of the same basic sequence S^(u′)(t) Denoting then {haeck over (s)}^(u′)(t) the function obtained by repeating S^(u′)(t): $\begin{matrix} {\Gamma^{{uu}^{\prime}} = {E\left( \left( \frac{\langle{{{\overset{\Cup}{s}}^{u^{\prime}}\left( {.{- \theta^{{uu}^{\prime}}}} \right)}{{{s_{B}^{u}\left( . \right)} - {s_{B}^{u}\left( . \right)}}\rangle}}}{{S}^{2}} \right)^{2} \right)}} & (28) \end{matrix}$

[0083] When the symbol block reduces to only one symbol, the expression Γ^(uu′) can be reformulated as: $\begin{matrix} {\Gamma^{{uu}^{\prime}} = {E\left( \left( \frac{\langle{{{\overset{\Cup}{s}}^{u^{\prime}}\left( {.{- \theta^{{uu}^{\prime}}}} \right)}{{{S^{u}\left( . \right)} - {S^{u}\left( {{.{- b}}\quad \delta} \right)}}\rangle}}}{{S}^{2}} \right)^{2} \right)}} & (29) \end{matrix}$

[0084] where the mean value is taken over the possible time shifts θ^(uu′) between the users u and u′ and the two possible values of b (two values have to be considered per time shift).

[0085] For symmetry reasons and in order to ensure a uniform MAI among the users, it seems reasonable to require that the coupling coefficients Γ^(uu′) are all identical. The expression (24) of the bit error rate can therefore be simplified: $\begin{matrix} {P_{e} = {{erfc}\left\{ {\left( {1 - {\cos \quad \alpha_{\delta}}} \right).\sqrt{\frac{E^{u}}{{\left( {N_{u} - 1} \right)\overset{\_}{E^{u^{\prime}\quad}}\Gamma} + {\beta_{\delta}^{2} \cdot \frac{N_{0}}{2}}}}} \right\}}} & (30) \end{matrix}$

[0086] where Γ is the common coupling coefficient and {overscore (E^(u′))} is the mean energy of the interfering signals. The expression (30) clearly shows that the bit error rate is an increasing function of Γ.

[0087] The expressions (28) and (29) can respectively be rewritten: $\begin{matrix} {\Gamma = {\int_{0}^{Tb}{\left( \frac{{{{\langle{s^{u^{\prime}}\left( {{.{- \theta}}\quad {mod}\quad T_{b}} \right)}}{s_{B}^{u}\left( . \right)}} - {s_{B}^{u}\left( . \right)}}\rangle}{{S}^{2}} \right)^{2}\quad {\theta}}}} & (31) \end{matrix}$

[0088] and $\begin{matrix} {\Gamma = {\int_{0}^{Ts}{\left( \frac{{{{\langle{S^{u^{\prime}}\left( {{.{- \theta}}\quad {mod}\quad T_{s}} \right)}}{S^{u}\left( . \right)}} - {S^{u}\left( {.{- \delta}} \right)}}\rangle}{{S}^{2}} \right)^{2}\quad {\theta}}}} & (32) \end{matrix}$

[0089] where mod denotes the modulo operation.

[0090] The coupling coefficient Γ is proposed here as a quality criterion for selecting sequences. A low value thereof of Γ indicates a “good” set of sequences with respect to multi-access interference. The value of the coupling coefficient essentially depends on the hopping patterns of the different users, the shape of the pulse waveform p(t) and the time amount δ. In practice, it is convenient to split the quality criterion in sub-criteria and, starting with the selection of the hopping patterns. An ad hoc sub-criterion leading to low values of Γ proved to be the average value (γ) of the squared periodic cross-correlation function of the hopping patterns. More precisely, denoting δ_(p) ^(u′) the periodic function obtained by repeating the hopping pattern of user u′, that is, denoting: $\begin{matrix} {{\delta_{p}^{u^{\prime}}(t)} = {{\delta^{u^{\prime}}(t)} \otimes {\sum\limits_{n}{\delta \left( {t - {nT}_{b}} \right)}}}} & (33) \end{matrix}$

$\left( {{{or}\quad {\delta_{p}^{u^{\prime}}(t)}} = {{\delta^{u^{\prime}}(t)} \otimes {\sum\limits_{n}{\delta \left( {t - {nT}_{s}} \right)}}}} \right.$

[0091] if one data symbol modulates one sequence) $\begin{matrix} {\gamma = {\frac{1}{T_{b}}{\int_{T_{b}}{\left( {c_{u^{\prime},u}(\tau)} \right)^{2}{\tau}}}}} & (34) \end{matrix}$

[0092] where $\begin{matrix} {{c_{u^{\prime},u}(\tau)} = \left( {\int_{0}^{T_{b}}{{\delta_{p}^{u^{\prime}}\left( {\left( {t + \tau} \right)\quad {mod}\quad T_{b}} \right)}{\delta^{u}(t)}{t}}} \right)} & (35) \end{matrix}$

[0093] (and similarly, $\gamma = {\frac{1}{T_{s}}{\int_{Ts}{\left( {\int_{0}^{T_{s}}{{\delta_{p}^{u^{\prime}}\left( {\left( {t + \tau} \right){mod}\quad T_{b}} \right)}{\delta^{u}(t)}{t}}} \right)^{2}{\tau}}}}$

[0094] in the above mentioned case).

[0095] It is important to note that the relevant criterion is not the maximum value of c_(u,u′)(τ) anymore, as in the prior art, but the average value of c_(u,u′) ²(τ) over the sequence length. This is due to the fact that, by using the transmission method according to the invention, the arrival times of the sequences of the users other than the one of interest (u) appear randomly scattered over the time range of a sequence of that user. The constraint upon the selection of hopping patterns or the corresponding sequences is therefore significantly relaxed.

[0096] The minimum non zero value of the periodic cross-correlation function c_(u,u′)(τ), in other words the minimum non zero number of coincidences (or hits) between two sequences of two distinct users for a given time shift τ, being equal to one and this value being taken N_(b) ² times by C_(u′,u)(τ) over [0, T_(b)[ (since any pulse of a time-shifted sequence of user u′ may coincide with any pulse of the sequence of user u), the minimum achievable value of γ is: $\begin{matrix} {\gamma_{\min} = {\frac{N_{b}^{2}}{T_{b}} = \frac{N_{b}}{N_{c} \cdot T_{c}}}} & (36) \end{matrix}$

[0097] or for a normalised chip length: $\begin{matrix} {\gamma_{\min} = \frac{N_{b}}{N_{c}}} & (37) \end{matrix}$

[0098] Most hopping patterns do not achieve γ=γ_(min). For example, if the sequence of a user u′ coincides with a time delayed version of the sequence of user u, there is one catastrophic collision for a given time shift τ (contributing for N_(b) ² in (34)) and at the best other N_(b) ²−N_(b) single hits, that is: $\begin{matrix} {\gamma \geq \frac{{2N_{b}^{2}} - N_{b}}{T_{b}}} & (38) \end{matrix}$

[0099] In contrast, it has been found that some hopping patterns do reach the minimum value γ_(min), like:

c_(j) ^(u)=u·j mod p   (39)

[0100] or come close to it, for example

c_(j) ^(u)=u^(j) mod p   (40)

[0101] where in both cases p is a prime number.

[0102] More generally, the following families of hopping patterns have equivalent properties to those expressed in (39) and (40) respectively and so since they amount to merely shuffling the sequences and/or rotating the frames within a sequence:

c _(j) ^(u)=(u+α)·(j+β)mod p   (41)

[0103] and

c _(j) ^(u)=(u+α)^((j+β)) mod p   (42)

[0104] where α, β are predetermined integers and p is a prime number.

[0105] Although, the transmission method and corresponding transmitter according to the invention have essentially been described for transmitting bits or block of bits, it should be understood that the invention more generally applies to the transmission of M-ary symbols or blocks thereof, in which case the pulse position modulation would use a plurality of delays δ₁,δ₂, . . . , δ_(M−1) for encoding said symbols. 

1. A method for transmitting data symbols to or from users of an ultra bandwidth telecommunication system, each user (u) of said system being associated with a specific time hopping pattern consisting of a plurality (N_(s), N_(b)) of integers (c_(j) ^(u)), a signal including said data symbols transmitted to or from a user consisting of sequences of frames, each integer of said specific time hopping pattern being associated with a corresponding frame and each frame containing a pulse time-shifted from the beginning thereof by an amount (c_(j) ^(u)T_(c)) determined by said associated integer, comprising: pulse position modulating one of said sequences by one or a plurality (n_(b)) of said data symbols to be transmitted to or from said user; and obtaining a time at which said sequence is transmitted from a pseudo-random sequence specific to said user.
 2. The method according to claim 1, further comprising: time-shifting the time at which the sequence is transmitted from a reference synchronisation signal common to all users by a time shift (θ_(m) ^(u)), said time shift being determined as a function of a number of a pseudo-random sequence specific to said user.
 3. The method according to claim 1, further comprising: time-shifting the time at which the sequence is transmitted from an end of a preceding sequence by a time shift (θ_(m) ^(u)), said time shift being determined as a function of a number of a pseudo-random sequence specific to said user.
 4. The method according to claim 1, further comprising: time-shifting the time at which the sequence is transmitted by a time shift from a synchronisation signal generated locally by said user, said time shift (θ_(m) ^(u)) being determined as a function of a number of a pseudo-random sequence specific to said user.
 5. The method according to claim 2, further comprising: obtaining a new time shift from said pseudo-random sequence for every sequence of a user.
 6. The method according to claim 3, further comprising: obtaining a new time shift from said pseudo-random sequence for every sequence of a user.
 7. The method according to any of claim 4, further comprising: obtaining a new time shift from said pseudo-random sequence for every sequence of a user.
 8. The method according to claim 2, further comprising: obtaining a new time shift from said pseudo-random sequence for each sequence of a user out of a predetermined plurality thereof.
 9. The method according to claim 3, further comprising: obtaining a new time shift from said pseudo-random sequence for each sequence of a user out of a predetermined plurality thereof.
 10. The method according to claim 4, further comprising: obtaining a new time shift from said pseudo-random sequence for each sequence of a user out of a predetermined plurality thereof.
 11. The method according to any one of claims 1-10, further comprising: chosing time hopping patterns of the different users such that an average value (γ) of a squared cross-correlation function of any pair of sequences of distinct users (u, u′) is equal or substantially equal to a predetermined minimum value (γ_(min))
 12. The method according to any one of claims 1-10, further comprising: determining a plurality of integers of the time hopping pattern associated with a user by the following expression: c _(j) ^(u)=(u+α)·(j+β) mod p where u is an integer indexing said user,j is an integer indexing a frame of a sequence of said user, α, β are predetermined integers, and p is a prime number.
 13. The method according to any one of claims 1-10, further comprising: determining a plurality of integers of the time hopping pattern associated to a user by the following expression: c _(j) ^(u)=(u+α)^((j+β))mod p where u is an integer indexing said user,j is an integer indexing a frame of a sequence of said user, α, β are predetermined integers, and p is a prime number.
 14. A transmitter for transmitting data symbols to or from at least one user of an ultra bandwidth telecommunication system, each user (u) of said system being associated with a specific time hopping pattern consisting of a plurality (N_(s), N_(b)) of integers (c_(j) ^(u)), said transmitter comprising: means for generating sequences of frames, each integer of said specific time hopping pattern being associated with a corresponding frame of said sequence; means for shifting a pulse of said corresponding frame of said sequence by an amount of time (c_(j) ^(u)T_(c)) determined by said associated integer; and means for modulating positions of pulses of a sequence by one or a plurality of data symbols to be transmitted to or from said user, comprising means for generating a pseudo-random sequence specific to said user, and means for determining, from a number of said pseudo-random sequence, a time at which a sequence is transmitted.
 15. A transmitter for transmitting data symbols to or from at least one user of an ultra bandwidth telecommunication system, each user (u) of said system being associated with a specific time hopping pattern consisting of a plurality (N_(s), N_(b)) of integers (c_(j) ^(u)), said transmitter comprising: a frame generator configured to generate a sequences of frames, each integer of said specific time hopping pattern being associated with a corresponding frame of said sequence; a pulse shifter configured to shift a pulse of said corresponding frame of said sequence by an amount of time (c_(j) ^(u)T_(c)) determined by said associated integer; and a pulse position modulator configured to modulate positions of pulses of a sequence by one or a plurality of data symbols to be transmitted to or from said user, comprising a pseudo-random sequence generator configured to for generate a pseudo-random sequence specific to said user, and a transmission timer configured to determine, from a number of said pseudo-random sequence, a time at which a sequence is transmitted.
 16. In a method for transmitting data symbols to or from users of an ultra bandwidth telecommunication system, each user (u) of said system being associated with a specific time hopping pattern consisting of a plurality (N_(s), N_(b)) of integers (c_(j) ^(u)), a signal including said data symbols transmitted to or from a user consisting of sequences of frames, each integer of said specific time hopping pattern being associated with a corresponding frame and each frame containing a pulse time-shifted from the beginning thereof by an amount (c_(j) ^(u)T_(c)) determined by said associated integer, the pulses of one of said sequences being further position modulated by one or a plurality (n_(b)) of said data symbols to be transmitted to or from said user, the improvement comprising: obtaining a time at which one of said sequences is transmitted from a pseudo-random sequence specific to said user. 